Two-weight ternary codes and the equation y2 = 4 × 3a + 13
نویسندگان
چکیده
منابع مشابه
Some ternary cubic two-weight codes
We study trace codes with defining set L, a subgroup of the multiplicative group of an extension of degree m of the alphabet ring F3+uF3+u 2 F3, with u 3 = 1. These codes are abelian, and their ternary images are quasi-cyclic of co-index three (a.k.a. cubic codes). Their Lee weight distributions are computed by using Gauss sums. These codes have three nonzero weights when m is singly-even and |...
متن کاملTernary Constant Weight Codes
Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.
متن کاملTwo classes of ternary codes and their weight distributions
In this paper we describe two classes of ternary codes, determine their minimum weight and weight distribution, and prove their properties. We also present four classes of 1-designs that are based on the classes of ternary codes.
متن کاملOn diameter perfect constant-weight ternary codes
From cosets of binary Hamming codes we construct diameter perfect constantweight ternary codes with weight n − 1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.
متن کاملOn Perfect Ternary Constant Weight Codes
We consider the space of ternary words of length n and fixed weightwwith the usual Hamming distance. A sequence of perfect single error correcting codes in this space is constructed. We prove the nonexistence of such codes with other parameters than those of the sequence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1983
ISSN: 0022-314X
DOI: 10.1016/0022-314x(83)90042-2